#include <iostream>
#include <algorithm>
using namespace std;
const int MAXN=1e5+10;
int n,p,ans,r[MAXN];
int main() {
    freopen("duel.in","r",stdin);
    freopen("duel.out","w",stdout);
    scanf("%d",&n);
    ans=n;
    for(int i=0;i<n;i++) scanf("%d",r+i);
    sort(r,r+n);
    for(int i=0;i<n;i++)
        if(r[p]<r[i]) {
            ans--;
            p++;
        }
    printf("%d\n",ans);
    return 0;
}